Mining Association Rules from Market Basket Data using Share Measures and Characterized Itemsets

نویسندگان

  • Robert J. Hilderman
  • Howard J. Hamilton
  • Colin L. Carter
  • Nick Cercone
چکیده

We propose the share-conndence framework for knowledge discovery from databases which addresses the problem of mining characterized association rules from market basket data (i.e., itemsets). Our goal is to not only discover the buying patterns of customers, but also to discover customer prooles by partitioning customers into distinct classes. We present a new algorithm for classifying itemsets based upon characteristic attributesextractedfrom census or lifestyle data. Our algorithmcombinesthe Apriori algorithm for discovering association rules between items in large databases, and the AOG algorithm for attribute-oriented generalization in large databases. We show how characterized itemsets can be generalized according to concept hierarchies associated with the characteristicattributes. Finally, we present experimental results that demonstrate the utility of the share-conndence framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Market Basket Data Using Share Measures and Characterized Itemsets

Abs t r ac t . We propose the share-confidence framework for knowledge discovery from databases which addresses the problem of mining itemsets from market basket data. Our goal is two-fold: (1) to present new itemset measures which are practical and useful alternatives to the commonly used support measure; (2) to not only discover the buying patterns of customers, but also to discover customer ...

متن کامل

A New Approach on Rare Association Rule Mining

Association rule mining is the process of finding some relations among the attributes/attribute values of huge database based on support value. Most existing association mining techniques are developed to generate frequent rules based on frequent itemsets generated on market basket datasets. A common property of these techniques is that they extract frequent itemsets and prune the infrequent it...

متن کامل

RDB-MINER: A SQL-Based Algorithm for Mining True Relational Databases

Traditionally, research in the area of frequent itemset mining has focused on mining market basket data. Several algorithms and techniques have been introduced in the literature for mining data represented in basket data format. The primary objective of these algorithms has been to improve the performance of the mining process. Unlike basket data representation, no algorithms exist for mining f...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

Rare Association Rule Mining

Association rule mining is the process of finding some relations among the attributes/attribute values of huge database based on support value. Most existing association mining techniques are developed to generate frequent rules based on frequent itemsets generated on market basket datasets. A common property of these techniques is that they extract frequent itemsets and prune the infrequent it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • International Journal on Artificial Intelligence Tools

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1998